Agents in Logistics Planning – Experiences with the Coalition Agents Experiment Project
نویسندگان
چکیده
Military logistics planning is a complex process, involving many calculations, satisfaction of constraints, and cooperation amongst many organisational entities that provide services in order to achieve military logistics goals. Multi-Agent Logistics Tool (MALT) is a project aimed at supporting military logistics planning. MALT is being developed using agent technology, where agents represent the organisations within the logistics domain, and model their logistics functions, processes, expertise, and interactions with other organisations. Agents are a suitable technology for modelling organisations within MALT, due to the similarity in characteristics between organisations and agents. A component of MALT was implemented within DARPA’s Coalition Agent Experiment (CoAX) project. We discuss the CoAX implementation of MALT, and lessons learnt. We discovered that implementing a centralised agent planning approach within MALT, and hence the decentralised military (operational) logistics planning domain, may not always be appropriate, and that a decentralised agent planning approach may be more suitable. Some of our observations regarding the future of agents for military logistics planning are discussed.
منابع مشابه
Dynamic Agent Systems in the CoAX Binni 2002 Experiment
The goal of the international CoAX (Coalition Agents eXperiment) program was to demonstrate how agent systems could be used to provide agile and flexible command and control systems for coalition operations, and facilitate rapid integration of national C2 systems. The CoAX experiments modelled a coalition C4ISR system as a distributed, heterogeneous agent network using the DARPA CoABS (Control ...
متن کاملHeuristic multiagent planning with self-interested agents
The focus of multiagent planning research has recently turned towards domains with self-interested agents leading to the definition of Coalition–Planning Games (CoPGs). In this paper, we investigate algorithms for solving a restricted class of “safe” CoPGs, in which no agent can benefit from making another agent’s plan invalid. We introduce a novel, generalised solution concept, and show how pr...
متن کاملA Pruning-Based Algorithm for Computing Optimal Coalition Structures in Linear Production Domains
Computing optimal coalition structures is an important research problem in multi-agent systems. It has rich application in real world problems, including logistics and supply chains. We study computing optimal coalition structures in linear production domains. The common goal of the agents is to maximize the system’s profit. Agents perform two steps: i) deliberate profitable coalitions, and ii)...
متن کاملA representation of usage in KA-TOOL
KA-Tool embodies work aimed at allowing domain experts to generate a domain model for an AI planning system, carried out as part of a larger project to build an integrated set of tools for supporting AI planning. In this paper, after an overview of the knowledge acquisition process, we describe an implemented induction process. This uses a set of positive examples to form a frame-based model wi...
متن کاملAgent-based Intelligent Support to Coalition Operations: a Case Study of Health Service Logistics Support
Coalition operations are very likely based on a number of different groups of people, non-governmental organizations, institutions providing humanitarian aid and also army troops and official governmental initiatives. As a result, to manage any coalition operation an efficient knowledge sharing between multiple participating parties is required. The paper proposes an approach that combines know...
متن کامل